Distributed Incremental Data Mining from Very Large Databases: A Rough Multiset Approach
نویسنده
چکیده
This paper presents a mechanism for developing distributed learners for learning production rules from massive, dynamic, and distributed databases. The task of distributed learning is formulated by the concept of multiset decision tables that is based on rough multisets and information multisystems, which are derived from the theory of rough sets. We use the concept of partition of boundary sets to represent and to combine distributed uncertain information. Learned rules are stored as multiset decision tables, which provide more compact representation, and they can be readily implemented using relational database technology.
منابع مشابه
Learning Rules from Very Large Databases Using Rough Multisets
This paper presents a mechanism called LERS-M for learning production rules from very large databases. It can be implemented using objectrelational database systems, it can be used for distributed data mining, and it has a structure that matches well with parallel processing. LERS-M is based on rough multisets and it is formulated using relational operations with the objective to be tightly cou...
متن کاملLearning Rules from Very Large Databases: A Rough Multiset Approach
This paper presents a mechanism LERS-M for learning production rules from very large databases. The task of learning is formulated by the concept of multiset decision tables based on rough multisets and information multisystems. LERS-M is tightly coupled with object-relational database systems, and it can also work on distributed database systems.
متن کاملApplication of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)
Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...
متن کاملIncremental Techniques for Mining Dynamic and Distributed Databases
Traditional methods for data mining typically make the assumptions that the data is centralized and static. These assumptions are no longer tenable. Such methods impose excessive communication overhead when data is distributed. Also, they waste computational and I/O resources when data is dynamic. In this paper we present what we believe to be the first data mining approach that overcomes all t...
متن کاملAn Intelligent Approach of Rough Set in Knowledge Discovery Databases
Knowledge Discovery in Databases (KDD) has evolved into an important and active area of research because of theoretical challenges and practical applications associated with the problem of discovering (or extracting) interesting and previously unknown knowledge from very large real-world databases. Rough Set Theory (RST) is a mathematical formalism for representing uncertainty that can be consi...
متن کامل